Effective branching splitting method under cost constraint
نویسندگان
چکیده
منابع مشابه
Inventory Cost Evaluation Under VMI Program with Lot Splitting
This paper aims to evaluate inventory cost of a Two-echelon serial supply chain system under vendor managed inventory program with stochastic demand, and examine the effect of environmental factors on the cost of overall system. For this purpose, we consider a two-echelon serial supply chain with a manufacturer and a retailer. Under Vendor managed inventory program, the decision on inventory ...
متن کاملAN EFFECTIVE METHOD FOR SIMULTANEOUSLY CONSIDERING TIME-COST TRADE-OFF AND CONSTRAINT RESOURCE SCHEDULING USING NONLINEAR INTEGER FRAMEWORK
Critical Path Method (CPM) is one of the most popular techniques used by construction practitioners for construction project scheduling since the 1950s. Despite its popularity, CPM has a major shortcoming, as it is schedule based on two impractical acceptance that the project deadline is not bounded and that resources are unlimited. The analytical competency and computing capability of CPM thus...
متن کاملinventory cost evaluation under vmi program with lot splitting
this paper aims to evaluate inventory cost of a two-echelon serial supply chain system under vendor managed inventory program with stochastic demand, and examine the effect of environmental factors on the cost of overall system. for this purpose, we consider a two-echelon serial supply chain with a manufacturer and a retailer. under vendor managed inventory program, the decision on inventory le...
متن کاملBranching Constraint Satisfaction Problems for Solutions Robust under Likely Changes
Many applications of CSPs require partial solutions to be found before all the information about the problem is available. We examine the case where the future is partially known, and where it is important to make decisions in the present that will be robust in the light of future events. We introduce the branching CSP to model these situations, incorporating some elements of decision theory, a...
متن کاملConstraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound procedure. In this work, the orbital branching methodology is extended so that the branching disjunction can be based on an arbitrary constraint. Many important families of integer programs are structured such that small in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2008
ISSN: 0304-4149
DOI: 10.1016/j.spa.2007.10.009